Control of self-assembly in micro- and nano-scale systems

Control of self-assembling systems at the micro- and nano-scale provides new opportunities for the engineering of novel materials in a bottom-up fashion. These systems have several challenges associated with control including high-dimensional and stochastic nonlinear dynamics, limited sensors for real-time measurements, limited actuation for control, and kinetic trapping of the system in undesirable configurations. Three main strategies for addressing these challenges are described, which include particle design (active self-assembly), open-loop control, and closed-loop (feedback) control. The strategies are illustrated using a variety of examples such as the design of patchy and Janus particles, the toggling of magnetic fields to induce the crystallization of paramagnetic colloids, and high-throughput crystallization of organic compounds in nanoliter droplets. An outlook of the future research directions and the necessary technological advancements for control of micro- and nano-scale self-assembly is provided.     

Programming assistance tools to support the learning of IT programming in South African secondary schools

Novice programmers struggle to understand introductory programming concepts and this difficulty, associated with learning to program, contributes mainly to the lack of interest in the field of Computer Science at tertiary level. Programming assistance tools have been used to assist novice programmers extensively at education institutions. A programming assistance tool (PAT) is a software program that can be used by novice programmers to learn how to program and/or improve their understanding of programming concepts.This research proposes that novice programmers, specifically Information Technology (IT) scholars in South African secondary schools, could be supported by PATs. The main objective of this research was to determine whether the use of a PAT impacted IT scholars' understanding of programming concepts and their motivation towards programming in general. Criteria for the selection of PATs were derived from the programming difficulties identified in literature and from surveys to IT teachers and scholars. The selection criteria were grouped into programming knowledge and programming skills categories. Existing PATs were evaluated using the selection criteria and three PATs, namely, RoboMind, Scratch and B#, were selected for evaluation in this research study. A convenience sample of schools participated in the study. The three PATs provided different approaches while being able to support the Delphi programming language used in schools that participated in the study.The findings of this research indicated that, although scholars perceived the PATs to be useful in the explanation of certain of the programming concepts, there was no conclusive evidence that IT scholars who used a PAT had a significantly better understanding of programming concepts and motivation towards programming than scholars who did not use a PAT. Participant feedback was used to identify the strengths and shortcomings of the three PATs and to provide recommendations for the development of future PATs specifically designed to support IT scholars.     

Small-gain stability conditions for linear systems with time-varying delays

In this paper we show that a variety of stability conditions, both existing and new, can be derived for linear systems subject to time-varying delays in a unified manner in the form of scaled small-gain conditions. From a robust control perspective, our development seeks to cast the stability problem as one of robust stability analysis, and the resulting stability conditions are also reminiscent of robust stability bounds typically found in robust control theory. The development is built on the well-known conventional robust stability analysis, requiring essentially no more than a straightforward application of the small gain theorem. The derived conditions have conceptual appeal, and they can be checked using standard robust control toolboxes.     

Analysis and decomposition of active and reactive power spot price in deregulated electricity markets

Electricity markets have suffered important modifications in recent decades in many countries, in which a competition framework has been established with the aim of improving market efficiency and reducing energy prices. However, this new paradigm does not assure optimal solutions, as new constraints can be introduced in optimization processes that can affect the resulting prices. An example of this situation is the establishment of power purchase agreements between producers and consumers. A wide literature can be found regarding electricity markets. Some of this literature refers to the theory of spot prices and its application to them. This paper deals with the obtaining, decomposition and deduction of behavior rules of spot prices, and their influence on established contractual relationships in a deregulated market environment which allows power purchase agreements between consumers and producers. It is performed by a deterministic modeling of the complete generation-grid system. The influence of the existence of this kind of agreements on both total costs and spot prices is discussed.     

Nonlinear adaptive filtering using kernel‐based algorithms with dictionary adaptation

Nonlinear adaptive filtering has been extensively studied in the literature, using, for example, Volterra filters or neural networks. Recently, kernel methods have been offering an interesting alternative because they provide a simple extension of linear algorithms to the nonlinear case. The main drawback of online system identification with kernel methods is that the filter complexity increases with time, a limitation resulting from the representer theorem, which states that all past input vectors are required. To overcome this drawback, a particular subset of these input vectors (called dictionary) must be selected to ensure complexity control and good performance. Up to now, all authors considered that, after being introduced into the dictionary, elements stay unchanged even if, because of nonstationarity, they become useless to predict the system output. The objective of this paper is to present an adaptation scheme of dictionary elements, which are considered here as adjustable model parameters, by deriving a gradient‐based method under collinearity constraints. The main interest is to ensure a better tracking performance. To evaluate our approach, dictionary adaptation is introduced into three well‐known kernel‐based adaptive algorithms: kernel recursive least squares, kernel normalized least mean squares, and kernel affine projection. The performance is evaluated on nonlinear adaptive filtering of simulated and real data sets. As confirmed by experiments, our dictionary adaptation scheme allows either complexity reduction or a decrease of the instantaneous quadratic error, or both simultaneously. Copyright © 2015 John Wiley & Sons, Ltd.     

Fault estimation and accommodation for networked control systems with nonuniform sampling periods

This paper deals with the problem of fault estimation and accommodation for a class of networked control systems with nonuniform uncertain sampling periods. Firstly, the reason why the adaptive fault diagnosis observer cannot be applied to networked control systems is analyzed. Based on this analysis, a novel robust fault estimation observer is constructed to estimate both continuous‐time fault and system states by using nonuniformly discrete‐time sampled outputs. Furthermore, using the obtained states and fault information, a nonuniformly sampled‐data fault tolerant control law is designed to preserve the stability of the closed‐loop system. The proposed scheme can not only guarantee the impact of continuous‐time uncertainties and discrete‐time sampled estimation errors on the faulty system to satisfy a H _∞ performance index but also repress the negative effect of the unknown intersample behavior of continuous‐time fault by use of an inequality technique. Finally, simulation results are included to demonstrate the feasibility of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.     

An improved particle swarm optimisation for unit commitment in microgrids with battery energy storage systems considering battery degradation and uncertainties

Using electric storage systems (ESSs) is known as a viable strategy to mitigate the volatility and intermittency of renewable distributed generators (DGs) in microgrids (MGs). Among different electric storage technologies, battery energy storage (BES) is considered as the best option. In unit commitment (UC) module, the set of committed dispatchable DGs along with their power, power exported to/imported from macrogrid and status and power of ESS units are determined. In this paper, BES degradation is considered in UC formulation and an efficient particle swarm optimisation with quadratic transfer function is proposed for solving UC in BES‐integrated MGs, while the uncertainties of demand, renewable generation and market price are considered and dealt with robust optimisation. UC is formulated as a multi‐objective optimisation problem whose objectives are MG operation cost and BES degradation. The resultant multi‐objective optimisation problem is converted into a single‐objective optimisation problem and the effect of weight factors on MG operation cost and BES lifecycle are investigated. The results show that by consideration of BES degradation in objective function, BES lifecycle increases from 350 to 500 and the minimum depth of charge increases from 5.5% to 34%; however, MG operation cost increases from $8717 to $8910.2. The results also show that by consideration of uncertainties, MG's operation cost increases by 8.22%.     

The VALU3S ECSEL project: Verification and validation of automated systems safety and security

Manufacturers of automated systems and their components have been allocating an enormous amount of time and effort in R&D activities, which led to the availability of prototypes demonstrating new capabilities as well as the introduction of such systems to the market within different domains. Manufacturers need to make sure that the systems function in the intended way and according to specifications. This is not a trivial task as system complexity rises dramatically the more integrated and interconnected these systems become with the addition of automated functionality and features to them. This effort translates into an overhead on the V&V (verification and validation) process making it time-consuming and costly. In this paper, we present VALU3S, an ECSEL JU (joint undertaking) project that aims to evaluate the state-of-the-art V&V methods and tools, and design a multi-domain framework to create a clear structure around the components and elements needed to conduct the V&V process. The main expected benefit of the framework is to reduce time and cost needed to verify and validate automated systems with respect to safety, cyber-security, and privacy requirements. This is done through identification and classification of evaluation methods, tools, environments and concepts for V&V of automated systems with respect to the mentioned requirements. VALU3S will provide guidelines to the V&V community including engineers and researchers on how the V&V of automated systems could be improved considering the cost, time and effort of conducting V&V processes. To this end, VALU3S brings together a consortium with partners from 10 different countries, amounting to a mix of 25 industrial partners, 6 leading research institutes, and 10 universities to reach the project goal.     

Optimized techniques for driving and control of the switched reluctance motor to improve efficiency

This work presents modeling, driving and classical speed control techniques for the switched reluctance motor. The aim is to improve the computational model, the control response and the machine efficiency. A parametric regression model was used to find the inductance profile of the switched reluctance motor and from the new inductance profile model. The drive and control techniques are shown: (i) with speed control acting on the excitation voltage and fixed switching angles, (ii) with speed control acting on the switching angles and fixed excitation voltage and (iii) with speed control acting on the excitation voltage, in this case, with dynamic switching angles and controller parameters. The inductance profile is represented by expression and inserted into the machine computer model, allowing greater precision and low computational cost. The speed control acting on the excitation voltage with dynamic controller parameters and dynamic switching angles allowed: (i) shorter response time for a wide range of control, (ii) higher efficiency, (iii) low computational cost and (iv) simplified implementation and maintenance. The techniques proposed in this work obtained precision of the computational model with respect to the system (in workbench) and optimized parameters in a wide range of the speed control, allowing an improvement of switched reluctance motor efficiency.     

Cloud based cyber-physical systems: Network evaluation study

In recent years, the Industry 4.0 concept brings new demands and trends in different areas; one of them is distributing computational power to the cloud. This concept also introduced the Reference Architectural Model for Industry 4.0 (RAMI 4.0). The efficiency of data communications within the RAMI 4.0 model is a critical issue. Aiming to evaluate the efficiency of data communication in the Cloud Based Cyber-Physical Systems (CB-CPS), this study analyzes the periods and data amount required to communicate with individual hierarchy levels of the RAMI 4.0 model. The evaluation of the network properties of the communication protocols eligible for CB-CPS is presented. The network properties to different cloud providers and data centers’ locations have been measured and interpreted. To test the findings, an architecture for cloud control of laboratory model was proposed. It was found that the time of the day; the day of the week; and data center utilization have a negligible impact on latency. The most significant impact lies in the data center distance and the speed of the communication channel. Moreover, the communication protocol also has impact on the latency. The feasibility of controlling each level of RAMI 4.0 through cloud services was investigated. Experimental results showed that control is possible in many solutions, but these solutions mostly cannot depend just on cloud services. The intelligence on the edge of the network will play a significant role. The main contribution is a thorough evaluation of different cloud providers, locations, and communication protocols to provide recommendations sufficient for different levels of the RAMI 4.0 architecture.